Direct multiple shooting method for solving approximate shortest path problems
نویسندگان
چکیده
منابع مشابه
Direct Multiple Shooting Method for Finding Approximate Shortest Paths in Polygonal Environments
We use the idea of the Direct Multiple Shooting Method (presented by H. G. Bock in Proceedings of the 9th IFAC world congress Budapest, Pergamon Press, 1984, for solving optimal control problems) to introduce an algorithm for solving some approximate shortest path problems in motion planning. The algorithm is based on a direct multiple shooting discretization that includes a collinear condition...
متن کاملALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS
We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...
متن کاملShooting Methods for Numerical Solution of Stochastic Boundary-Value Problems
In the present investigation, numerical methods are developed for approximate solution of stochastic boundary-value problems. In particular, shooting methods are examined for numerically solving systems of Stratonovich boundary-value problems. It is proved that these methods accurately approximate the solutions of stochastic boundary-value problems. An error analysis of these methods is perform...
متن کاملApproximate Shortest Path Calculations in Simple Polyhedra
This paper considers the calculation of a Euclidean shortest path (ESP) in a three-dimensional (3D) polyhedral space Π . We propose an approximate κ(ε) · O(M |V |) 3D ESP algorithm (excluding preprocessing), with preprocessing time complexity O(M |E| + |S| + |V | log |V |), for solving a special, but ‘fairly general’ case of the 3D ESP problem, where Π does not need to be convex, V and E are th...
متن کاملExact Implementation of Multiple Initial Conditions in the DQ Solution of Higher-Order ODEs
The differential quadrature method (DQM) is one of the most elegant and useful approximate methods for solving initial and/or boundary value problems. It is easy to use and also straightforward to implement. However, the conventional DQM is well-known to have some difficulty in implementing multiple initial and/or boundary conditions at a given discrete point. To overcome this difficulty, this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Computational Applied Mathematics
دوره 244 شماره
صفحات -
تاریخ انتشار 2013